Uncertainty Reasoning based on Gradational Lattice-Valued First-Order Logic Lvfl

نویسندگان

  • Zhiyan Chang
  • Yang Xu
  • Weifeng Du
  • Minghui Wu
چکیده

The current paper discusses the uncertainty reasoning method based on gradational lattice-valued firstorder logic Lvfl. For some representative uncertainty reasoning models, some concrete methods for selecting appropriate parameters during the uncertainty reasoning process based on lattice-valued first-order logic Lvfl are proposed. Emphasis is placed on the research of the consistent of L-type fuzzy sets of formulas.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uncertainty Reasoning Based on Lattice-Valued First-Order Logic Lvfl

Uncertainty reasoning is one of the important issues of many research fields, such as artificial intelligence, knowledge-based systems, data-mining etc.. This paper proposes the theory of uncertainty reasoning in the “If...then...” type uncertainty reasoning mode based on the lattice-valued first-order logic Lvfl. The “If...then...” rule presented here is the rule in which both antecedent and c...

متن کامل

Determination of α -Resolution for Lattice-Valued First-Order Logic Based on Lattice Implication Algebra

As a continuation of our research work on resolutionbased automated reasoning approaches for latticevalued logic systems with truth-values in a latticevalued logical algebraic structure – lattice implication algebra (LIA), in the present paper, we prove thatα resolution for lattice-valued first-order logic ( ) LF X based on LIA can be equivalently transformed into that for lattice-valued propos...

متن کامل

TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS

In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...

متن کامل

A Linguistic-Valued Approximate Reasoning Approach for Financial Decision Making

In order to process the linguistic-valued information with uncertainty in the financial decisionmaking, the present work uses a lattice-valued logical algebra lattice implication algebra to deal with both comparable and incomparable linguistic truth-values. A new personal financial decision auxiliary modeling framework based on the lattice-ordered linguistic truth-valued logic is proposed. The ...

متن کامل

α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems

In this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic systemL P(X) based on lattice implication algebra. Firstly, the notions of lattice-valued Horn generalized clause, normal lattice-valued Horn generalized clause and unit latticevalued Horn generalized clause are given in L P(X). Then, the α-resolution o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009